def isr(x,y):
if (x,y)==(0,0):
return 0
else:
return abs(x)+abs(y)
a , b , s = map(int,input().split())
t = isr(a,b)
if t<s :
if (s-t)%2 !=0:
print("NO")
else:
print("YES")
elif t==s:
print("YES")
else:
print("NO")
#include <bits/stdc++.h>
using namespace std;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
int arr[10000];
int main()
{
FIO;
long long a , b ,s ;
cin>>a>>b>>s;
if (a < 0 )
a = a * -1 ;
if (b<0)
b = b * -1;
if (s >= (a+b))
{
if ((s-(a+b) )%2 ==0)
cout <<"YES";
else
cout <<"NO";
}
else
cout <<"NO";
return 0;
}
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |